A Branch-and-bound Algorithm For Array Distributions
نویسندگان
چکیده
An important problem facing parallelizing compilers for distributed memory mimd machines is that of distributing data across processors. This distribution aaects the amout of data movements among processors that is required to execute the computations of the input program. This work proposes a branch{and{bound based method to automatically compute a distribution for the arrays of the input program. The method is able to arrange redistributions of data during program execution. To test the proposed method, we have embedded it into an experimental parallelizing compiler for an Intel iPSC=860. Results with this compiler for example like the Livermore Loop Kernels show that the computed data distributions are very good.
منابع مشابه
Single Array and Bound Method (RESEARCH NOTE).
One of the major disadvantages of using Branch and Bound algorithm to solve permutation bases problems by computer is the size of main memory required. The single Array Branch and Bound (SABB) method introduction here aims to overcome this deficiency, using only N memory locations as a vector of size N, and a single cell C with N bits.
متن کاملA new network simplex algorithm to reduce consecutive degenerate pivots and prevent stalling
It is well known that in operations research, degeneracy can cause a cycle in a network simplex algorithm which can be prevented by maintaining strong feasible bases in each pivot. Also, in a network consists of n arcs and m nodes, not considering any new conditions on the entering variable, the upper bound of consecutive degenerate pivots is equal $left( begin{array}{c} n...
متن کاملAn Algorithm Based on Theory of Constraints and Branch and Bound for Solving Integrated Product-Mix-Outsourcing Problem
One of the most important decision making problems in many production systems is identification and determination of products and their quantities according to available resources. This problem is called product-mix. However, in the real-world situations, for existing constrained resources, many companies try to provide some products from external resources to achieve more profits. In this pape...
متن کاملتخمین جهت منابع با استفاده از زیرفضای کرونکر
This paper proceeds directions of arrival (DOA) estimation by a linear array. These years, some algorithms, e.g. Khatri-Rao approach, Nested array, Dynamic array have been proposed for estimating more DOAs than sensors. These algorithms can merely estimate uncorrelated sources. For Khatri-Rao approach, this is due to the fact that Khatri-Rao product discard the non-diagonal entries of the corre...
متن کاملA modified branch and bound algorithm for a vague flow-shop scheduling problem
Uncertainty plays a significant role in modeling and optimization of real world systems. Among uncertain approaches, fuzziness describes impreciseness while for ambiguity another definition is required. Vagueness is a probabilistic model of uncertainty being helpful to include ambiguity into modeling different processes especially in industrial systems. In this paper, a vague set based on dista...
متن کاملA Branch and Bound Method for Finding Flow Path Designing of Agv Systems (RESEARCH NOTE)
One of the important factor in the design of automated guided vehicle systems (AGVS) is the flow path design. This paper presents a branch-and-bound algorithm to determining the flow path by considering not only loaded-vehicles, but also empty-vehicles. The objective is to find the flow path, which will minimize total travel of loaded vehicles. We know that in branch-and-bound method a branch c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994